Maximal sets of Hamilton cycles in Dn
نویسندگان
چکیده
In this paper, we prove that there exists a maximal set of m directed Hamilton cycles in Dn if and only if n/2 m n − 1 for n 7. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Maximal sets of hamilton cycles in complete multipartite graphs
A set S of edge-disjoint hamilton cycles in a graph G is said to be maximal if the edges in the hamilton cycles in S induce a subgraph H of G such that G EðHÞ contains no hamilton cycles. In this context, the spectrum SðGÞ of a graph G is the set of integersm such that G contains a maximal set of m edge-disjoint hamilton cycles. This spectrum has
متن کاملHamilton decompositions of graphs with primitive complements
A k-factor of a graph is a k-regular spanning subgraph. A Hamilton cycle is a connected 2-factor. A graph G is said to be primitive if it contains no k-factor with 1 ≤ k < ∆(G). A Hamilton decomposition of a graph G is a partition of the edges of G into sets, each of which induces a Hamilton cycle. In this paper, by using the amalgamation technique, we find necessary and sufficient conditions f...
متن کاملMaximal sets of Hamilton cycles in complete multipartite graphs II
A set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton cycles in S form a subgraph of T such that T −E(S) has no hamilton cycle. The set of integers m for which a graph T contains a maximal set of m edge-disjoint hamilton cycles has previously been determined whenever T is a complete graph, a complete bipartite graph, and in many cases when T is a complete m...
متن کاملMaximal sets of hamilton cycles in K2p-F
A set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton cycles in S form a subgraph of T such that T − E(S) has no hamilton cycle. The spectrum of a graph T is the set of integers m such that T contains a maximal set of m edge-disjoint hamilton cycles. This spectrum has previously been determined for all complete graphs, all complete bipartite graphs, and man...
متن کاملOn the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs
A graph G = (V,E) on n vertices is super -regular if (i) all vertices have degree in the range [(d − )n, (d + )n], dn being the average degree, and (ii) for every pair of disjoint sets S, T ⊆ V, |S|, |T | ≥ n, e(S, T ) is in the range [(d− )|S||T |, (d+ )|S||T |]. We show that the number of perfect matchings lies in the range [((d−2 )ν n! ν!2ν , (d+ 2 )ν n! ν!2ν ], where ν = n 2 , and the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008